On the implementation of a log-barrier progressive hedging method for multistage stochastic programs

نویسندگان

  • Xinwei Liu
  • Kim-Chuan Toh
  • Gongyun Zhao
چکیده

A progressive hedging method incorporated with self-concordant barrier functions has been developed by Zhao [23] for solving multistage stochastic programs. The method relaxes the nonanticipativity constraints by the Lagrangian dual approach and smooths the Lagrangian dual function by self-concordant barrier functions. This paper discusses in detail the implementation of this method and reports results of preliminary numerical experiments. We compare the performance of this method with the well-known progressive hedging method proposed by Rockafellar and Wets [17]. keywords: Progressive hedging method, multistage stochastic programs, Lagrangian dual, log-barrier method, ∗Research is partially supported by NUS Academic Research Grant R-146-000-006-112 †This author is on leave from Hebei University of Technology, Tianjin, China. The research is partially supported by SRF for ROCS, SEM. ‡Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543. Email: [email protected]. §Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543. Email: [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal scenario set partitioning for multistage stochastic programming with the progressive hedging algorithm

In this paper, we propose a new approach to reduce the total running time (RT) of the progressive hedging algorithm (PHA) for solving multistage stochastic programs (MSPs) defined on a scenario tree. Instead of using the conventional scenario decomposition scheme, we apply a multi-scenario decomposition scheme and partition the scenario set in order to minimize the number of non-anticipativity ...

متن کامل

Integration of progressive hedging and dual decomposition in stochastic integer programs

We present a method for integrating the Progressive Hedging (PH) algorithm and the Dual Decomposition (DD) algorithm of Carøe and Schultz for stochastic mixed-integer programs. Based on the correspondence between lower bounds obtained with PH and DD, a method to transform weights from PH to Lagrange multipliers in DD is found. Fast progress in early iterations of PH speeds up convergence of DD ...

متن کامل

Combining Progressive Hedging with a Frank-wolfe

We present a new primal-dual algorithm for computing the value of the Lagrangian 6 dual of a stochastic mixed-integer program (SMIP) formed by relaxing its nonanticipativity con7 straints. The algorithm relies on the well-known progressive hedging method, but unlike previous 8 progressive hedging approaches for SMIP, our algorithm can be shown to converge to the optimal 9 Lagrangian dual value....

متن کامل

A Progressive Hedging Based Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Progressive Hedging (PH) is a well-known algorithm for solving multi-stage stochastic convex optimization problems. Most previous extensions of PH for stochastic mixed-integer programs have been implemented without convergence guarantees. In this paper, we present a new framework that shows how PH can be utilized while guaranteeing convergence to globally optimal solutions of stochastic mixed-i...

متن کامل

Working Paper on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs

A general decomposition framework for large convex optimization problems based on augmented Lagrangians is described. The approach is then applied to multistage stochastic programming problems in two di erent ways: by decomposing the problem into scenarios and by decomposing it into nodes corresponding to stages. Theoretical convergence properties of the two approaches are derived and a computa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 234  شماره 

صفحات  -

تاریخ انتشار 2010